Verification Methods for Finite Systems
نویسندگان
چکیده
The increasing complexity of concurrent systems requires the development of rigorous design methods. This need has motivated research on specification formalisms and the associated verification methods and tools. By verification, we mean the comparison of a system against its specifications. We consider that a system is described by a program. Specifications describe the service provided by the system and may concern both qualitative and quantitative aspects of its behaviour. In this paper, we do not address the verification problem of quantitative requirements such as reliability or performance.
منابع مشابه
A New Restructured Shaded Pole Induction Motor- 3D Finite Element Analysis and Experimental Verification
Shaded pole induction motors, despite the simplicity and low cost, are difficult to analyze particularly in the equivalent circuit methods, due to the asymmetric structure, saturation, harmonics, inaccurate estimation of leakage inductances and skew. Hence, 3D numerical methods could be very useful in the design and optimization stage. This paper presents the 3D transient finite element analysi...
متن کاملUsing Exciting and Spectral Envelope Information and Matrix Quantization for Improvement of the Speaker Verification Systems
Speaker verification from talking a few words of sentences has many applications. Many methods as DTW, HMM, VQ and MQ can be used for speaker verification. We applied MQ for its precise, reliable and robust performance with computational simplicity. We also used pitch frequency and log gain contour for further improvement of the system performance.
متن کاملFinite countermodels for safety verification of parameterized tree systems
In this paper we deal with verification of safety properties of parameterized systems with a tree topology. The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which further resolved by a generic finite model finding procedure. A finite countermodel method is shown is at least as powerful as regular tree model checking a...
متن کاملThe Implicit Set Paradigm: A New Approach to Finite State System Verification
This paper presents a new state of the art in the field of finite state system verification. The paradigm of this approach is to represent and to manipulate these systems in an implicit way. The computational costs of the verification procedures using this paradigm depend on the costs of the operations performed on this implicit representation instead of the number of states and transitions of ...
متن کاملUsing Exciting and Spectral Envelope Information and Matrix Quantization for Improvement of the Speaker Verification Systems
Speaker verification from talking a few words of sentences has many applications. Many methods as DTW, HMM, VQ and MQ can be used for speaker verification. We applied MQ for its precise, reliable and robust performance with computational simplicity. We also used pitch frequency and log gain contour for further improvement of the system performance.
متن کاملSafety Verification of Real Time Systems Serving Periodic Devices
In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005